Proof of a≡b(mod n) iff a and b leaves same remainder when divided by n

0:08:02

Proof of a≡b(mod n) iff a and b leaves same remainder when divided by n

0:11:33

Number Theory 44 - Theorem: a≡b(mod m)⇔a=b+km,∃k∈ℤ

0:04:45

If a ≡ b (mod m ) , then prove that a^n ≡ b^n (mod m) || Property of Congruence || Number theory.

0:05:33

Use Fermat's theorem to verify that 17 divides 11^104+1

0:09:30

If p & q are different primes such that a^p=a (mod q) and a^q=a (mod p), then a^(pq) = a (mod pq) .

0:30:33

The art of computer programming Volume 3_4